The Conflict-Driven Answer Set Solver clasp: Progress Report
نویسندگان
چکیده
We summarize the salient features of the current version of the answer set solver clasp, focusing on the progress made since version RC4 of clasp. Apart from enhanced preprocessing and search-supporting techniques, a particular emphasis lies on advanced reasoning modes, such as cautious and brave reasoning, optimization, solution projection, and incremental solving.
منابع مشابه
clasp : A Conflict-Driven Answer Set Solver
We describe the conflict-driven answer set solver clasp, which is based on concepts from constraint processing (CSP) and satisfiability checking (SAT). We detail its system architecture and major features, and provide a systematic empirical evaluation of its features.
متن کاملConflict-Driven Answer Set Enumeration
We elaborate upon a recently proposed approach to finding an answer set of a logic program based on concepts from constraint processing and satisfiability checking. We extend this approach and propose a new algorithm for enumerating answer sets. The algorithm, which to our knowledge is novel even in the context of satisfiability checking, is implemented in the clasp answer set solver. We contra...
متن کاملConflict-driven answer set solving: From theory to practice
We introduce an approach to computing answer sets of logic programs, based on concepts successfully applied in Satisfiability (SAT) checking. The idea is to view inferences in Answer Set Programming (ASP) as unit propagation on nogoods. This provides us with a uniform constraint-based framework capturing diverse inferences encountered in ASP solving. Moreover, our approach allows us to apply ad...
متن کاملclasp, claspfolio, aspeed: Three Solvers from the Answer Set Solving Collection Potassco
clasp1 combines the high-level modeling capacities of Answer Set Programming (ASP; [1]) with state-of-the-art techniques from the area of Boolean constraint solving. It is originally designed and optimized for conflict-driven ASP solving [2], [3], [4]. Most of its innovative algorithms and data structures, like e.g. ASP-oriented pre-processing [5] or native support of aggregates [6], are thus o...
متن کاملConflict-Driven Answer Set Solving
We introduce a new approach to computing answer sets of logic programs, based on concepts from constraint processing (CSP) and satisfiability checking (SAT). The idea is to view inferences in answer set programming (ASP) as unit propagation on nogoods. This provides us with a uniform constraintbased framework for the different kinds of inferences in ASP. It also allows us to apply advanced tech...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009